Generating Anaphora for Simplifying Text

نویسندگان

  • Advaith Siddharthan
  • Ann Copestake
چکیده

Abstract We present an algorithm for generating referring expressions in open domains. Existing algorithms assume a classification of adjectives which is possible only for restricted domains. Our alternative relies on WordNet synonym and antonym sets and gives equivalent results on the examples cited in the literature and improved results in other cases that prior approaches cannot handle. We believe that it is also the first algorithm that allows for the incremental incorporation of relations. We perform an evaluation on a text-simplification task on Wall Street Journal data.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Resolving and Generating Definite Anaphora by Modeling Hypernymy using Unlabeled Corpora

We demonstrate an original and successful approach for both resolving and generating definite anaphora. We propose and evaluate unsupervised models for extracting hypernym relations by mining cooccurrence data of definite NPs and potential antecedents in an unlabeled corpus. The algorithm outperforms a standard WordNet-based approach to resolving and generating definite anaphora. It also substa...

متن کامل

Generating Grammatical and Lexical Anaphora in Assembly Instructional Texts

In this paper, we discuss the problem of generating natural anaphora in assembly instructional texts. We rst present a detailed account of grammatical and lexical anaphora and we examine a set of constraints for selecting these devices. As language is often redundant and an optimal referring expression is computationally prohibitive, we take the view that the generation of anaphora should be ba...

متن کامل

About the effects of using Anaphora Resolution in assessing free-text student answers

In this paper we present a possibility for integrating Anaphora Resolution (AR) in a system to automatically evaluate students’ free-text answers. An initial discussion introduces some of the several methods that can be tried out. The implementation makes use of the AR-Engine RARE (Cristea et al. 02), integrated into the free-text answers assessor Atenea (Alfonseca & Pérez 04) to test these met...

متن کامل

Preserving Discourse Structure when Simplifying Text

Text simplification involves restructuring sentences by replacing particular syntactic constructs (like embedded clauses and appositives). The aim is to make the text easier to read for some target group (like aphasics and people with low reading ages) or easier to process by some program (like a parser or machine translation system). However, sentencelevel syntactic restructuring can wreak hav...

متن کامل

Lexical choice in context: generating procedural texts

This paper shows how lexical choice during text generation depemls on linguistic context. We argue that muking c(Irrect lexieal choice in rite textual context requires distinguishing properties of concepts, which are ntme or less independent of file language, from language-specific representations of text where lexemes and their semantic and symantic relations are represented. In particular, l....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002